Average Consensus by Graph Filtering: New Approach, Explicit Convergence Rate, and Optimal Design
نویسندگان
چکیده
منابع مشابه
Privacy-preserving Average Consensus: Privacy Analysis and Optimal Algorithm Design
The goal of the privacy-preserving average consensus (PPAC) is to guarantee the privacy of initial states and asymptotic consensus on the exact average of the initial value. This goal is achieved by an existing PPAC algorithm by adding and subtracting variance decaying and zero-sum random noises to the consensus process. However, there is lack of theoretical analysis to quantify the degree of t...
متن کاملOn the convergence of weighted-average consensus
In this note we give sufficient conditions for the convergence of the iterative algorithm called weighted-average consensus in directed graphs. We study the discrete-time form of this algorithm. We use standard techniques from matrix theory to prove the main result. As a particular case one can obtain well-known results for non-weighted average consensus. We also give a corollary for undirected...
متن کاملStochastic Average Consensus Filter for Distributed HMM Filtering: Almost Sure Convergence
In this paper, we study almost sure convergence of a dynamic average consensus algorithm which allows distributed computation of the product of n time-varying conditional probability density functions. These density functions (often called as “belief functions”) correspond to the conditional probability of observations given the state of an underlying Markov chain, which is observed by n differ...
متن کاملA new approach to optimal nonlinear filtering
The classical approach to designing lters for systems where system equations are linear and measurement equations are nonlinear is to linearise measurement equations, and apply an Extended Kalman Filter (EKF). This results in suboptimal, biased, and often divergent lters. Many schemes proposed to improve the performance of the EKF concentrated on better linearisation techniques, iterative techn...
متن کاملConsensus clustering by graph based approach
In this paper, we propose G-Cons, an extension of a graph minimal coloring paradigm for consensus clustering. Based on the coassociation values between data, our approach is a graph partitioning one which yields a combined partition by maximizing an objective function given by the average mutual information between the consensus partition and all initial combined clusterings. It exhibits more i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2020
ISSN: 0018-9286,1558-2523,2334-3303
DOI: 10.1109/tac.2019.2907410